Phase domain modulation method dependent on spatial position

ABSTRACT

A phase domain modulation method dependent on a spatial position is provided. The method mainly includes the following steps: a transmitter and a receiver perform time synchronization to obtain a synchronization time; the transmitter performs a phase domain precoding operation on an original signal to obtain a phase domain pre-coded signal; the receiver receives the phase domain pre-coded signal, obtains a phase domain initial reception signal, and performs a phase domain matching operation on the phase domain initial reception signal to obtain an estimation of the original signal.

CROSS REFERENCE TO THE RELATED APPLICATIONS

This application is the national phase entry of International Application No. PCT/CN2021/090981, filed on Apr. 29, 2021, which is based upon and claims priority to Chinese Patent Application No. 202011235645.5, filed on Nov. 9, 2020, the entire contents of which are incorporated herein by reference.

TECHNICAL FIELD

The present invention belongs to the technical field of telecommunications, and in particular, relates to a phase domain modulation method dependent on a spatial position.

BACKGROUND

Traditional anti-interception and anti-deception methods depend on encryption and authentication technologies above the network layer. However, with the improvement of computing power, upper-layer encryption and authentication technologies are facing severe challenges. For example, it is difficult to manage, distribute and maintain secret keys. Long secret keys cause high computing overhead and a waste of resources. The improvement of eavesdropping capability imposes great threat on the upper-layer encryption methods based on computational complexity. In order to deal with these problems, the physical-layer secure communication is proposed over the world. The security gate is moved forward, and the randomness (interference, noise, etc.) of the physical-layer is used to get rid of the dependence on the long secret keys. However, most of the existing physical-layer secure communication technologies depend on the reciprocity of a wireless channel, but the reciprocity of the channel is difficult to be strictly met. Although the existing spatial physical-layer security technologies, such as spatial beamforming and direction modulation, can get rid of the limitation of channel reciprocity, only the security performance in the angle domain can be provided. If the eavesdropper and the legitimate receiver are located at the same direction angle, no security is ensured.

SUMMARY

An objective of the present invention is to overcome the defects mentioned above, and provide a phase domain modulation method dependent on a spatial position.

The technical problems of the present invention are solved as follows:

a phase domain modulation method dependent on a spatial position is based on a transmitter, a receiver and a plurality of channel resources, where the transmitter is configured to process and transmit an original signal, the receiver is configured to recover the original signal, the channel resources are used by the transmitter and the receiver, and the channel resources include time-domain, frequency-domain, space-domain and code-domain resources.

The method of the present invention includes the following steps:

-   -   S1: performing time synchronization by the transmitter and the         receiver to obtain a synchronization time;     -   S2: performing, by the transmitter, a phase domain precoding         operation on the original signal to obtain a phase domain         pre-coded signal, and transmitting, by the transmitter, the         phase domain pre-coded signal to the receiver using the         plurality of channel resources; and     -   S3: receiving, by the receiver, the phase domain pre-coded         signal to obtain a phase domain initial reception signal, and         performing a phase domain matching operation on the phase domain         initial reception signal to obtain an estimation of the original         signal.

In S2, the phase domain precoding operation includes the following steps:

-   -   S2-1: generating, by the transmitter, a high-dimensional         precoding signal β(t+Δτ) according to the synchronization time t         and a transmission delay Δτ to the receiver:

${\beta\left( {t + {\Delta\tau}} \right)} = \begin{bmatrix} \begin{matrix} \begin{matrix} {\beta_{1}\left( {t + {\Delta\tau}} \right)} \\ {\beta_{2}\left( {t + {\Delta\tau}} \right)} \end{matrix} \\  \vdots  \end{matrix} \\ {\beta_{N}\left( {t + {\Delta\tau}} \right)} \end{bmatrix}$

-   -   wherein β_(j)(t+Δτ) represents the j^(th) dimension of the         high-dimensional precoding signal, j=1, 2, . . . , N, N         represents a number of dimensions of the high-dimensional         precoding signal, and N does not exceed a number of the channel         resources,

${\beta_{j}\left( {t + {\Delta\tau}} \right)} = {\delta + {\prod\limits_{p = 1}^{T}{A_{p,n_{p}}{\cos\left\lbrack {2{\pi\left( {n_{p} - 1} \right)}\Delta{f_{p}\left( {t + {\Delta\tau}} \right)}} \right\rbrack}}}}$

-   -   wherein T represents a number of phase domain precoding layers,         T≥1, 1≤p≤T, n_(p) represents an index of the p^(th) layer of         phase domain precoding branches, 1≤n_(p)≤N_(p), N_(p) represents         a number of the p^(th) layer of phase domain precoding branches,

${{N_{1} \times N_{2} \times \ldots \times N_{T}} = N},{{n_{t} + {\sum\limits_{p = 1}^{T - 1}\left\lbrack {\left( {n_{p} - 1} \right)\text{?}{\prod\limits_{p + 1}^{T}{N\text{?}}}} \right\rbrack}} = j},{\Delta f_{p}}$ ?indicates text missing or illegible when filed

represents a frequency increment of the p^(th) layer, A_(p,n) _(p) represents an amplitude of a precoding signal on the n_(p) ^(th) branch in the p^(th) layer of phase domain precoding branch, and δ is a normal number agreed by the transmitter and the receiver in advance and has a value meeting

${{\delta + {\prod\limits_{p = 1}^{T}{A_{p,n_{p}}{\cos\left\lbrack {2{\pi\left( {n_{p} - 1} \right)}\Delta{f_{p}\left( {t + {\Delta\tau}} \right)}} \right\rbrack}}}} > 0};$

-   -   S2-2: performing phase domain high-dimensional mapping on a         phase ∠s₀(t) of the original signal to obtain a high-dimensional         original phase signal ∠s(t):

${{\angle{s(t)}} = \begin{bmatrix} \begin{matrix} \begin{matrix} {\angle{s_{1}(t)}} \\ {\angle{s_{2}(t)}} \end{matrix} \\  \vdots  \end{matrix} \\ {\angle{s_{N}(t)}} \end{bmatrix}},{{\sum\limits_{j = 1}^{N}{\angle{s_{j}(t)}}} = {{{\angle s}_{0}(t)}{mod}\left( {2\pi} \right)}}$

-   -   wherein a number of dimensions of the high-dimensional original         phase signal is N, s_(j)(t) represents the j^(th) dimension of         the high-dimensional original signal, and mod is a remainder         function; and     -   S2-3: processing the high-dimensional original phase signal         according to the high-dimensional precoding signal to obtain a         phase domain pre-coded signal ξ(t);

${\xi(t)} = {\begin{bmatrix} \begin{matrix} \begin{matrix} {\xi_{1}(t)} \\ {\xi_{2}(t)} \end{matrix} \\  \vdots  \end{matrix} \\ {\xi_{N}(t)} \end{bmatrix} = \begin{bmatrix} \begin{matrix} \begin{matrix} {\exp\left\lbrack {j\angle{s_{1}(t)}{\beta_{1}\left( {t + {\Delta\tau}} \right)}} \right\rbrack} \\ {\exp\left\lbrack {j\angle{s_{2}(t)}{\beta_{2}\left( {t + {\Delta\tau}} \right)}} \right\rbrack} \end{matrix} \\  \vdots  \end{matrix} \\ {\exp\left\lbrack {j\angle{s_{N}(t)}{\beta_{N}\left( {t + {\Delta\tau}} \right)}} \right\rbrack} \end{bmatrix}}$

-   -   wherein j′=√{square root over (−1)}, and ξ_(j)(t) represents the         j^(th) dimension of the phase domain pre-coded signal.

In S3, a specific process of the phase domain matching operation is as follows:

${{\hat{s}}_{0}^{\prime}(t)} = {{\exp\left\{ {{j\left\lbrack {{\gamma_{1}(t)}{\gamma_{2}(t)}\ldots{\gamma_{N}(t)}} \right\rbrack}\begin{bmatrix} \begin{matrix} \begin{matrix} {{\hat{\xi}}_{1}(t)} \\ {{\hat{\xi}}_{2}(t)} \end{matrix} \\  \vdots  \end{matrix} \\ {{\hat{\xi}}_{N}(t)} \end{bmatrix}} \right\}} = {\exp\left\lbrack {j{\sum\limits_{j = 1}^{N}{{\gamma_{j}(t)}\angle{{\hat{\xi}}_{j}(t)}}}} \right\rbrack}}$

-   -   wherein {circumflex over (ξ)}(t)=[{circumflex over (ξ)}₁(t)         {circumflex over (ξ)}₂(t) . . . {circumflex over         (ξ)}_(N)(t)]^(T) represents a phase domain initial reception         signal, a superscript T represents transposition, [∠{circumflex         over (ξ)}₁(t) ∠{circumflex over (ξ)}₂(t) . . . ∠{circumflex over         (ξ)}_(N)(t)]^(T) represents a phase of the phase domain initial         reception signal, ∠ represents a phase taking operation,         γ_(j)(t) represents a matched signal corresponding to         β_(j)(t+Δτ) and has a value meeting

${{\gamma\text{?}(t)\left\{ {\delta + {\prod\limits_{p = 1}^{T}{A_{p,n_{p}}{\cos\left\lbrack {2{\pi\left( {n_{p} - 1} \right)}\Delta f_{p}^{t}} \right\rbrack}}}} \right\}} = {1{mod}\left( {2\pi} \right)}},$ ?indicates text missing or illegible when filed

and ŝ′₀(t) represents an estimation of the original signal.

In S2-2, the phase domain high-dimensional mapping adopts the following methods:

-   -   a first method:

${{\angle{s}_{j}(t)} = {\frac{1}{N}\angle{s_{0}(t)}}};$

and

-   -   a second method:

${{\angle{s}_{j}(t)} = {{\frac{1}{N}\angle{s_{0}(t)}} + {\theta_{j}(t)}}},$

where θ_(j) (t) is a j^(th) phase domain random offset signal and meets that [θ₁(t) θ₂(t) . . . θ_(N)(t)]^(T) is located in a solution space of an equation

${\sum\limits_{j = 1}^{N}{\theta_{j}(t)}} = 0.$

Further, the transmitter adopts a narrow-beam antenna to be pointed to the receiver.

A phase domain modulation method dependent on a spatial position is based on a transmitter, a receiver and a plurality of channel resources, where the transmitter is configured to process and transmit an original signal, the receiver is configured to recover the original signal, the channel resources are used by the transmitter and the receiver, and the channel resources include time-domain, frequency-domain, space-domain and code-domain resources.

The method of the present invention includes the following steps:

-   -   S1: performing time synchronization by the transmitter and the         receiver to obtain a synchronization time;     -   S2: performing, by the transmitter, a phase domain precoding         operation on the original signal to obtain a phase domain         pre-coded signal, performing, by the transmitter, an I/Q domain         precoding operation on the phase domain pre-coded signal to         obtain an I/Q domain pre-coded signal, and transmitting, by the         transmitter, the I/Q domain pre-coded signal to the receiver         using the channel resources; and     -   S3: receiving, by the receiver, the I/Q domain pre-coded signal         to obtain an I/Q domain initial reception signal, performing an         I/Q domain matching operation on the I/Q domain initial         reception signal to obtain an I/Q domain matched signal, and         performing, by the receiver, a phase domain matching operation         on the I/Q domain matched signal to obtain an estimation of the         original signal.

In S2, the phase domain precoding operation includes the following steps:

-   -   S2-1: generating, by the transmitter, a phase domain         high-dimensional precoding signal β(t+Δτ) according to the         synchronization time t and a transmission delay Δτ to the         receiver:

${\beta\left( {t + {\Delta\tau}} \right)} = \begin{bmatrix} \begin{matrix} \begin{matrix} {\beta_{1}\left( {t + {\Delta\tau}} \right)} \\ {\beta_{2}\left( {t + {\Delta\tau}} \right)} \end{matrix} \\  \vdots  \end{matrix} \\ {\beta_{N}\left( {t + {\Delta\tau}} \right)} \end{bmatrix}$

-   -   wherein β_(j)(t+Δτ) represents the j^(th) dimension of the phase         domain high-dimensional precoding signal, j=1, 2, . . . , N, N         represents a number of dimensions of the high-dimensional         precoding signal, and N does not exceed a number of the channel         resources,

${\beta_{j}\left( {t + {\Delta\tau}} \right)} = {\delta + {\prod\limits_{p = 1}^{T}{A_{p,n_{p}}{\cos\left\lbrack {2{\pi\left( {n_{p} - 1} \right)}\Delta{f_{p}\left( {t + {\Delta\tau}} \right)}} \right\rbrack}}}}$

-   -   wherein T represents a number of phase domain precoding layers,         T≥1, 1≤p≤T, n_(p) represents an index of the p^(th) layer of         phase domain precoding branches, 1≤n_(p)≤N_(p), N_(p) represents         a number of the p^(th) layer of phase domain precoding branches,         N₁×N₂× . . . ×N_(T)=N,

${{n_{T} + {\sum\limits_{p = 1}^{T - 1}\left\lbrack {\left( {n_{p} - 1} \right){\prod\limits_{l = {p + 1}}^{T}N_{l}}} \right\rbrack}} = j},$ Δf_(p)

represents a frequency increment of the p^(th) layer, A_(p,n) _(p) represents an amplitude of a precoding signal on the n_(p) ^(th) branch in the p^(th) layer of phase domain precoding branch, and δ is a normal number agreed by the transmitter and the receiver in advance and has a value meeting

${{\delta + {\prod\limits_{p = 1}^{T}{A_{p,n_{p}}{\cos\left\lbrack {2{\pi\left( {n_{p} - 1} \right)}\Delta{f_{p}\left( {t + {\Delta\tau}} \right)}} \right\rbrack}}}} > 0};$

-   -   S2-2: performing phase domain high-dimensional mapping on a         phase ∠s₀(t) of the original signal to obtain a high-dimensional         original phase signal ∠s(t);

${{\angle{s(t)}} = \left\lbrack \begin{matrix} {\angle{s_{1}(t)}} \\ {\angle{s_{2}(t)}} \\  \vdots \\ {\angle{s_{N}(t)}} \end{matrix} \right\rbrack},$ ${\sum\limits_{j = 1}^{N}{\angle{s_{j}(t)}}} = {\angle{s_{0}(t)}{{mod}\left( {2\pi} \right)}}$

-   -   wherein a number of dimensions of the high-dimensional original         phase signal is N, s_(j)(t) represents the j^(th) dimension of         the high-dimensional original signal, and mod is a remainder         function; and     -   S2-3: processing the high-dimensional original phase signal         according to the high-dimensional precoding signal to obtain a         phase domain pre-coded signal ξ(t);

${\xi(t)} = {\begin{bmatrix} {\xi_{1}(t)} \\ {\xi_{2}(t)} \\  \vdots \\ {\xi_{N}(t)} \end{bmatrix} = \begin{bmatrix} {\exp\left\lbrack {j\angle{s_{1}(t)}{\beta_{1}\left( {t + {\Delta\tau}} \right)}} \right\rbrack} \\ {\exp\left\lbrack {j\angle s_{2}(t)\beta_{2}\left( {t + {\Delta\tau}} \right)} \right\rbrack} \\  \vdots \\ {\exp\left\lbrack {j\angle s_{N}(t)\beta_{N}\left( {t + {\Delta\tau}} \right)} \right\rbrack} \end{bmatrix}}$

-   -   wherein ξ_(j)(t) represents the j^(th) dimension of the phase         domain pre-coded signal.

The I/Q domain precoding operation comprises the following steps:

-   -   S2-4: generating, by the transmitter, an I/Q domain         high-dimensional precoding signal α(t+Δτ) according to the         synchronization time t and a transmission delay Δτ to the         receiver:

${\alpha\left( {t + {\Delta\tau}} \right)} = \begin{bmatrix} {\alpha_{1}\left( {t + {\Delta\tau}} \right)} \\ {\alpha_{2}\left( {t + {\Delta\tau}} \right)} \\  \vdots \\ {\alpha_{M}\left( {t + {\Delta\tau}} \right)} \end{bmatrix}$

-   -   wherein α_(i)(t+Δτ) represents the i^(th) dimension of the I/Q         domain high-dimensional precoding signal, i=1, 2, . . . , M, M         represents the number of dimensions of the high-dimensional         precoding signal, and M×N does not exceed the number of the         channel resources,

${\alpha_{i}\left( {t + {\Delta\tau}} \right)} = {\prod\limits_{m = 1}^{L}{\exp\left\lbrack {{- j}2{\pi\left( {k_{m} - 1} \right)}\Delta{f_{m}\left( {t + {\Delta\tau}} \right)}} \right\rbrack}}$

-   -   wherein j=√{square root over (−1)}, m=1, 2, . . . , L, L         represents a number of I/Q domain precoding layers, L≥1, k_(m)         represents an index of the m^(th) layer of I/Q domain precoding         branches, 1≤k_(m)≤M_(m), M_(m) represents a number of the m^(th)         layer of I/Q domain precoding branches, M₁×M₂× . . . ×M_(L)=M,

${{k_{L} + {\sum\limits_{m = 1}^{L - 1}\left\lbrack {\left( {k_{m} - 1} \right){\prod\limits_{l = {m + 1}}^{L}M_{l}}} \right\rbrack}} = i},$

and Δf_(m) represents a frequency increment of the m^(th) layer; and

-   -   S2-5: performing I/Q domain high-dimensional mapping on the         j^(th) dimension ξ_(j)(t) of the phase domain pre-coded signal         ξ(t) to obtain a j^(th) high-dimensional signal ξ_(j)(t);

${{\xi_{j}(t)} = \begin{bmatrix} {\xi_{j,1}(t)} \\ {\xi_{j,2}(t)} \\  \vdots \\ {\xi_{j,M}(t)} \end{bmatrix}},$ ${\sum\limits_{k = 1}^{M}{\xi_{j,k}(t)}} = {\xi_{j}(t)}$

-   -   wherein a number of dimensions of the j^(th) high-dimensional         signal is M, and ξ_(j,k)(t) is the k^(th) dimension of the         j^(th) high-dimensional signal ξ_(j)(t); and     -   S2-6: processing the j^(th) high-dimensional signal according to         the I/Q domain high-dimensional precoding signal to obtain a         j^(th) I/Q domain pre-coded signal x_(j)(t):

${x_{j}(t)} = {\begin{bmatrix} {x_{j,1}(t)} \\ {x_{j,2}(t)} \\  \vdots \\ {x_{j,M}(t)} \end{bmatrix} = \begin{bmatrix} {{\xi_{j,1}(t)}{\alpha_{1}\left( {t + {\Delta\tau}} \right)}} \\ {{\xi_{j,2}(t)}{\alpha_{2}\left( {t + {\Delta\tau}} \right)}} \\  \vdots \\ {{\xi_{j,M}(t)}{\alpha_{M}\left( {t + {\Delta\tau}} \right)}} \end{bmatrix}}$

-   -   wherein x_(j,k)(t) represents the k^(th) dimension of the j^(th)         I/Q domain pre-coded signal, and     -   combining, by the transmitter, the j^(th) I/Q domain pre-coded         signal into an I/Q domain pre-coded signal:

${x(t)} = \begin{bmatrix} {x_{1}(t)} \\ {x_{2}(t)} \\  \vdots \\ {x_{N}(t)} \end{bmatrix}$

In S3, a specific process of the I/Q domain matching operation is as follows:

${{\hat{\xi}}_{j}(t)} = {{\begin{bmatrix} {\alpha_{1}^{*}(t)} & {\alpha_{2}^{*}(t)} & \cdots & {\alpha_{M}^{*}(t)} \end{bmatrix}\begin{bmatrix} {{\hat{x}}_{j,1}(t)} \\ {{\hat{x}}_{j,2}(t)} \\  \vdots \\ {{\hat{x}}_{j,M}(t)} \end{bmatrix}} = {\sum\limits_{k = 1}^{M}{{\alpha_{k}^{*}(t)}{{\hat{x}}_{j,k}(t)}}}}$ ${{\hat{x}(t)} = \begin{bmatrix} {{\hat{x}}_{1}(t)} \\ {{\hat{x}}_{2}(t)} \\  \vdots \\ {{\hat{x}}_{N}(t)} \end{bmatrix}},$ ${{\hat{x}}_{j}(t)} = \begin{bmatrix} {{\hat{x}}_{j,1}(t)} \\ {{\hat{x}}_{j,2}(t)} \\  \vdots \\ {{\hat{x}}_{j,M}(t)} \end{bmatrix}$

-   -   wherein {circumflex over (x)}(t) represents an I/Q domain         initial reception signal,

${{\alpha_{k}^{*}(t)} = {\prod\limits_{m = 1}^{L}{\exp\left\lbrack {j2{\pi\left( {k_{m} - 1} \right)}\Delta f_{m}t} \right\rbrack}}},$

* represents conjugation, {circumflex over (ξ)}_(i)(t) represents the i^(th) dimension of an I/Q matched signal, and the finally obtained I/Q domain matched signal is as follows:

${\hat{\xi}(t)} = \begin{bmatrix} {{\hat{\xi}}_{1}(t)} \\ {{\hat{\xi}}_{2}(t)} \\  \vdots \\ {{\hat{\xi}}_{N}(t)} \end{bmatrix}$

-   -   a specific process of the phase domain matching operation is as         follows:

${{\hat{s}}_{0}^{\prime}(t)} = {\exp\left\{ {{j\begin{bmatrix} {\gamma_{1}(t)} & {\gamma_{2}(t)} & \cdots & {\gamma_{N}(t)} \end{bmatrix}}\begin{bmatrix} {\angle{{\hat{\xi}}_{1}(t)}} \\ {\angle{\hat{\xi}}_{2}(t)} \\  \vdots \\ {\angle{\hat{\xi}}_{N}(t)} \end{bmatrix}} \right\}{\exp\left\lbrack {j{\sum\limits_{j = 1}^{N}{{\gamma_{j}(t)}\angle{{\hat{\xi}}_{l}(t)}}}} \right\rbrack}}$

-   -   wherein γ_(j)(t) represents a matched signal corresponding to         β_(j)(t+Δτ) and has a value meeting

${{{\gamma_{j}(t)}\left\{ {\delta + {\prod\limits_{p = 1}^{T}{A_{p,n}\text{?}{\cos\left\lbrack {2{\pi\left( {n_{p} - 1} \right)}\Delta f_{p}^{t}} \right\rbrack}}}} \right\}} = {1{mod}\left( {2\pi} \right)}},$ ?indicates text missing or illegible when filed

and ŝ′₀(t) represents an estimation of the original signal.

In S2-2, the phase domain high-dimensional mapping adopts the following methods:

-   -   a first method:

${{\angle{s_{j}(t)}} = {\frac{1}{N}\angle{s_{0}(t)}}};$

and

-   -   the second method:

${{\angle{s_{j}(t)}} = {{\frac{1}{N}\angle{s_{0}(t)}} + {\theta_{j}(t)}}},$

-   -   where θ_(j)(t) is a j^(th) phase domain random offset signal and         meets that [θ₁(t) θ₂(t) . . . θ_(N)(t)]^(T) is located in a         solution space of an equation

${\sum\limits_{j = 1}^{N}{\theta_{j}(t)}} = 0.$

In S2-5, the I/Q domain high-dimensional mapping adopts the following methods:

-   -   a first method:

${{\zeta_{j,i}(t)} = {\frac{1}{M}{\zeta_{j}(t)}}};$

and

-   -   the second method:

${{\zeta_{j,i}(t)} = {{\frac{1}{M}{\zeta_{j}(t)}} + {n\text{?}(t)}}},$ ?indicates text missing or illegible when filed

where n_(i)(t) is an i^(th) I/Q domain random offset signal and meets that [n₁(t) n₂(t) . . . n_(M)(t)]^(T) is located in a solution space of an equation

${\sum\limits_{i = 1}^{M}{n\text{?}(t)}} = 0.$ ?indicates text missing or illegible when filed

Further, the transmitter adopts a narrow-beam antenna to be pointed to the receiver.

The beneficial effects of the present invention are:

According to the phase domain signal processing method of the present invention, secure communication is achieved without reducing the power efficiency of a system. The dependence of a physical-layer secure communication system on channel state information can be overcome, and the security in the distance domain is realized, so that only the legitimate receiver at an expected distance can receive a correct signal while the receiver at other distances cannot receive the correct signal.

BRIEF DESCRIPTION OF THE DRAWINGS

FIGS. 1A and 1B are schematic flowcharts of a method according to Embodiment 2 of the present invention.

DETAILED DESCRIPTION OF THE EMBODIMENTS

The present invention is further described with reference to the accompanying drawings and embodiments.

Embodiment 1

This embodiment provides a phase domain modulation method dependent on a spatial position, which is based on a transmitter, a receiver and a plurality of channel resources, where the transmitter is configured to process and transmit an original signal, the receiver is configured to recover the original signal, the channel resources are used by the transmitter and the receiver, and the channel resources include time-domain, frequency-domain, space-domain and code-domain resources.

The method in this embodiment includes the following steps:

-   -   S1: time synchronization is performed by the transmitter and the         receiver to obtain a synchronization time;     -   S2: the transmitter performs a phase domain precoding operation         on the original signal to obtain a phase domain pre-coded         signal, and the transmitter transmits the phase domain pre-coded         signal to the receiver using the plurality of channel resources;         and     -   S3: the receiver receives the phase domain pre-coded signal to         obtain a phase domain initial reception signal, and a phase         domain matching operation is performed on the phase domain         initial reception signal to obtain an estimation of the original         signal.

In S2, the phase domain precoding operation includes the following steps:

-   -   S2-1: generating, by the transmitter, a high-dimensional         precoding signal β(t+Δτ) according to the synchronization time t         and a transmission delay Δτ to the receiver:

${\beta\left( {t + {\Delta\tau}} \right)} = \begin{bmatrix} \begin{matrix} \begin{matrix} {\beta_{1}\left( {t + {\Delta\tau}} \right)} \\ {\beta_{2}\left( {t + {\Delta\tau}} \right)} \end{matrix} \\  \vdots  \end{matrix} \\ {\beta_{N}\left( {t + {\Delta\tau}} \right)} \end{bmatrix}$

-   -   wherein β_(j)(t+Δτ) represents the j^(th) dimension of the         high-dimensional precoding signal, j=1, 2, . . . , N, N         represents the number of dimensions of the high-dimensional         precoding signal, and N does not exceed a number of the channel         resources,

${\beta_{j}\left( {t + {\Delta\tau}} \right)} = {\delta + {\prod\limits_{p = 1}^{T}{A_{p,n_{p}}{\cos\left\lbrack {2{\pi\left( {n_{p} - 1} \right)}\Delta{f_{p}\left( {t + {\Delta\tau}} \right)}} \right\rbrack}}}}$

-   -   wherein T represents a number of phase domain precoding layers,         T≥1, 1≤p≤T, n_(p) represents an index of the p^(th) layer of         phase domain precoding branches, 1≤n_(p)≤N_(p), N_(p) represents         a number of the p^(th) layer of phase domain precoding branches,         N₁×N₂× . . . ×N_(T)=N,

${{n_{T} + {\sum\limits_{p = 1}^{\tau - 1}\left\lbrack {\left( {n_{p} - 1} \right){\sum\limits_{l = {p + 1}}^{\tau}{N\text{?}}}} \right\rbrack}} = j},$ ?indicates text missing or illegible when filed

Δf_(p) represents a frequency increment of the p^(th) layer, A_(p,n) _(p) represents an amplitude of a precoding signal on a n_(p) ^(th) branch in the p^(th) layer of phase domain precoding branch and has a value determined in advance, and δ is a normal number agreed by the transmitter and the receiver in advance and has a value meeting

${{\delta + {\sum\limits_{p = 1}^{T}{A_{p,n_{p}}{\cos\left\lbrack {2{\pi\left( {n_{p} - 1} \right)}\Delta{f_{p}\left( {t + {\Delta\tau}} \right)}} \right\rbrack}}}} > 0};$

-   -   S2-2: performing phase domain high-dimensional mapping on a         phase ∠s₀(t) of the original signal to obtain a high-dimensional         original phase signal ∠s(t):

${{\angle{s(t)}} = \begin{bmatrix} \begin{matrix} \begin{matrix} {\angle{s_{1}(t)}} \\ {\angle{s_{2}(t)}} \end{matrix} \\  \vdots  \end{matrix} \\ {\angle{s_{N}(t)}} \end{bmatrix}},{{\sum\limits_{j = 1}^{N}{\angle{s_{j}(t)}}} = {\angle{s_{0}(t)}{mod}\left( {2\pi} \right)}}$

-   -   wherein the number of dimensions of the high-dimensional         original phase signal is N, s_(j)(t) represents the j^(th)         dimension of the high-dimensional original signal, and mod is a         remainder function; and     -   S2-3: processing the high-dimensional original phase signal         according to the high-dimensional precoding signal to obtain a         phase domain pre-coded signal ξ(t);

${\zeta(t)} = {\begin{bmatrix} \begin{matrix} \begin{matrix} {\xi_{1}(t)} \\ {\xi_{2}(t)} \end{matrix} \\  \vdots  \end{matrix} \\ {\xi_{N}(t)} \end{bmatrix} = \begin{bmatrix} \begin{matrix} \begin{matrix} {\exp\left\lbrack {j\angle{s_{1}(t)}{\beta_{1}\left( {t + {\Delta\tau}} \right)}} \right\rbrack} \\ {\exp\left\lbrack {j\angle s_{2}(t)\beta_{2}\left( {t + {\Delta\tau}} \right)} \right\rbrack} \end{matrix} \\  \vdots  \end{matrix} \\ {\exp\left\lbrack {j\angle s_{N}(t)\beta_{N}\left( {t + {\Delta\tau}} \right)} \right\rbrack} \end{bmatrix}}$

-   -   wherein j=√{square root over (−1)}, and ξ_(j)(t) represents the         j^(th) dimension of the phase domain pre-coded signal.

In S3, a specific process of the phase domain matching operation is as follows:

${{\hat{s}}_{0}^{\prime}(t)} = {{\exp\left\{ {{j\begin{bmatrix} \begin{matrix} \begin{matrix} {\gamma_{1}(t)} & {\gamma_{2}(t)} \end{matrix} & \ldots \end{matrix} & {\gamma_{N}(t)} \end{bmatrix}}\begin{bmatrix} \begin{matrix} \begin{matrix} {\angle{{\hat{\xi}}_{1}(t)}} \\ {\angle{\hat{\xi}}_{2}(t)} \end{matrix} \\  \vdots  \end{matrix} \\ {\angle{\hat{\xi}}_{N}(t)} \end{bmatrix}} \right\}} = {\exp\left\lbrack {j{\sum\limits_{j = 1}^{N}{{\gamma_{j}(t)}{{\angle\xi}_{1}(t)}}}} \right\rbrack}}$

-   -   wherein {circumflex over (ξ)}(t)=[{circumflex over (ξ)}₁(t)         {circumflex over (ξ)}₂(t) . . . {circumflex over         (ξ)}_(N)(t)]^(T) represents a phase domain initial reception         signal, a superscript T represents transposition, [∠{circumflex         over (ξ)}₁(t) ∠{circumflex over (ξ)}₂(t) . . . ∠{circumflex over         (ξ)}_(N)(t)]^(T) represents a phase of the phase domain initial         reception signal, ∠ represents a phase taking operation,         γ_(j)(t) represents a matched signal corresponding to         β_(j)(t+Δτ) and has a value meeting

${{{\gamma_{1}(t)}\left\{ {\delta + {\sum\limits_{p = 1}^{T}{A_{p,n_{p}}{\cos\left\lbrack {2{\pi\left( {n_{p} - 1} \right)}\Delta f_{p}^{t}} \right\rbrack}}}} \right\}} = {1{mod}\left( {2\pi} \right)}},$

and ŝ′₀(t) represents an estimation of the original signal.

In S2-2, the phase domain high-dimensional mapping adopts the following methods:

-   -   a first method:

${{{\angle s}_{j}(t)} = {\frac{1}{N}{{\angle s}_{0}(t)}}};$

and

-   -   a second method:

${{{\angle s}_{j}(t)} = {{\frac{1}{N}{{\angle s}_{0}(t)}} + {\theta_{1}(t)}}},$

where θ_(j)(t) is a j^(th) phase domain random offset signal and meets that [θ₁(t) θ₂(t) . . . θ_(N)(t)]^(T) is located in a solution space of an equation

${\sum\limits_{j = 1}^{N}{\theta_{1}(t)}} = 0.$

Further, the transmitter adopts a narrow-beam antenna to be pointed to the receiver.

Embodiment 2

This embodiment provides a spatial position-dependent modulation method, which is based on a transmitter, a receiver and a plurality of channel resources, where the transmitter is configured to process and transmit an original signal, the receiver is configured to recover the original signal, the channel resources are used by the transmitter and the receiver, and the channel resources include time-domain, frequency-domain, space-domain and code-domain resources.

The schematic flowcharts of the method in this embodiment are shown in FIGS. 1A and 1B, including the following steps:

-   -   S1: time synchronization is performed by the transmitter and the         receiver to obtain a synchronization time;     -   S2: the transmitter performs a phase domain precoding operation         on the original signal to obtain a phase domain pre-coded         signal, the transmitter performs an I/Q domain precoding         operation on the phase domain pre-coded signal to obtain an I/Q         domain pre-coded signal, and the transmitter transmits the I/Q         domain pre-coded signal to the receiver using the channel         resources; and     -   S3: the receiver receives the I/Q domain pre-coded signal to         obtain an I/Q domain initial reception signal, an I/Q domain         matching operation is performed on the I/Q domain initial         reception signal to obtain an I/Q domain matched signal, and the         receiver performs a phase domain matching operation on the I/Q         domain matched signal to obtain an estimation of the original         signal.

In S2, the phase domain precoding operation includes the following steps:

-   -   S2-1: generating, by the transmitter, a phase domain         high-dimensional precoding signal β(t+Δτ) according to the         synchronization time t and a transmission delay Δτ to the         receiver:

${\beta\left( {t + {\Delta\tau}} \right)} = \begin{bmatrix} {\beta_{1}\left( {t + {\Delta\tau}} \right)} \\ {\beta_{2}\left( {t + {\Delta\tau}} \right)} \\  \vdots \\ {\beta_{N}\left( {t + {\Delta\tau}} \right)} \end{bmatrix}$

-   -   wherein β_(j)(t+Δτ) represents the j^(th) dimension of the phase         domain high-dimensional precoding signal, j=1, 2, . . . , N, N         represents a number of dimensions of the high-dimensional         precoding signal, and N does not exceed a number of the channel         resources,

${\beta_{j}\left( {t + {\Delta\tau}} \right)} = {\delta + {\prod\limits_{p = 1}^{T}{A_{p,n_{p}}{\cos\left\lbrack {2{\pi\left( {n_{p} - 1} \right)}\Delta{f_{p}\left( {t + {\Delta\tau}} \right)}} \right\rbrack}}}}$

-   -   wherein T represents the number of phase domain precoding         layers, T≥1, 1≤p≤T, n_(p) represents an index of a p^(th) layer         of phase domain precoding branches, 1≤n_(p)≤N_(p), N_(p)         represents a number of the p^(th) layer of phase domain         precoding branches, N₁×N₂× . . . ×N_(T)=N,

${{n_{T} + {\sum\limits_{p = 1}^{T - 1}\left\lbrack {\left( {n_{p} - 1} \right){\prod\limits_{i = {p + 1}}^{T}N_{1}}} \right\rbrack}} = j},$

Δf_(p) represents a frequency increment of the p^(th) layer, A_(p,n) _(p) represents an amplitude of a precoding signal on a n_(p) ^(th) branch in the p^(th) layer of phase domain precoding branch and has a value determined in advance, and δ is a normal number agreed by the transmitter and the receiver in advance and has a value meeting

${\delta + {\prod\limits_{p = 1}^{T}{A_{p,n_{p}}{\cos\left\lbrack {2{\pi\left( {n_{p} - 1} \right)}\Delta{f_{p}\left( {t + {\Delta\tau}} \right)}} \right\rbrack}}}} > 0.$

-   -   S2-2: performing phase domain high-dimensional mapping on a         phase ∠s₀(t) of the original signal to obtain a high-dimensional         original phase signal ∠s(t):

${{{\angle s}(t)} = \begin{bmatrix} {{\angle s}_{1}(t)} \\ {{\angle s}_{2}(t)} \\  \vdots \\ {{\angle s}_{N}(t)} \end{bmatrix}},{{\sum\limits_{j = 1}^{N}{{\angle s}_{j}(t)}} = {{{\angle s}_{0}(t)}{mod}\left( {2\pi} \right)}}$

-   -   wherein the number of dimensions of the high-dimensional         original phase signal is N, s_(j)(t) represents the j^(th)         dimension of the high-dimensional original signal, and mod is a         remainder function.

In S2-2, the phase domain high-dimensional mapping adopts the following methods:

-   -   a first method:

${{{\angle s}_{j}(t)} = {\frac{1}{N}{{\angle s}_{0}(t)}}};$

and

-   -   a second method:

${{{\angle s}_{j}(t)} = {{\frac{1}{N}{{\angle s}_{0}(t)}} + {\theta_{1}(t)}}},$

where θ_(j) (t) is a j^(th) phase domain random offset signal and meets that [θ₁(t) θ₂(t) . . . θ_(N)(t)]^(T) is located in a solution space of an equation

${\sum\limits_{j = 1}^{N}{\theta_{j}(t)}} = 0.$

-   -   S2-3: processing the high-dimensional original phase signal         according to the high-dimensional precoding signal to obtain a         phase domain pre-coded signal ξ(t):

${\xi(t)} = {\begin{bmatrix} {\xi_{1}(t)} \\ {\xi_{2}(t)} \\  \vdots \\ {\xi_{N}(t)} \end{bmatrix} = \begin{bmatrix} {\exp\left\lbrack {j{{\angle s}_{1}(t)}{\beta_{1}\left( {t + {\Delta\tau}} \right)}} \right\rbrack} \\ {\exp\left\lbrack {j{\angle s}_{2}(t)\beta_{2}\left( {t + {\Delta\tau}} \right)} \right\rbrack} \\  \vdots \\ {\exp\left\lbrack {j{\angle s}_{N}(t)\beta_{N}\left( {t + {\Delta\tau}} \right)} \right\rbrack} \end{bmatrix}}$

-   -   wherein ξ_(j)(t) represents the j^(th) dimension of the phase         domain pre-coded signal.

The I/Q domain precoding operation comprises the following steps:

-   -   S2-4: the transmitter generates an I/Q domain high-dimensional         precoding signal α(t+Δτ) according to the synchronization time t         and a transmission delay Δτ to the receiver:

${\alpha\left( {t + {\Delta\tau}} \right)} = \begin{bmatrix} {\alpha_{1}\left( {t + {\Delta\tau}} \right)} \\ {\alpha_{2}\left( {t + {\Delta\tau}} \right)} \\  \vdots \\ {\alpha_{M}\left( {t + {\Delta\tau}} \right)} \end{bmatrix}$

-   -   wherein α_(i)(t+Δτ) represents the i^(th) dimension of the I/Q         domain high-dimensional precoding signal, i=1, 2, . . . , M, M         represents the number of dimensions of the high-dimensional         precoding signal, and M×N does not exceed the number of the         channel resources,

${\alpha_{i}\left( {t + {\Delta\tau}} \right)} = {\sum\limits_{m = 1}^{L}{\exp\left\lbrack {{- j}2{\pi\left( {k_{m} - 1} \right)}\Delta{f_{m}\left( {t + {\Delta\tau}} \right)}} \right\rbrack}}$

-   -   wherein j=√{square root over (−1)}, m=1, 2, . . . , L, L         represents a number of I/Q domain precoding layers, L≥1, k_(m)         represents an index of the m^(th) layer of I/Q domain precoding         branches, 1≤k_(m)≤M_(m), M_(m) represents the number of the         m^(th) layer of I/Q domain precoding branches, M₁×M₂× . . .         ×M_(L)=M,

${{k_{L} + {\sum\limits_{m = 1}^{L - 1}\left\lbrack {\left( {k_{m} - 1} \right){\prod\limits_{l = {m + 1}}^{L}M_{1}}} \right\rbrack}} = i},$

and Δf_(m) represents a frequency increment of the m^(th) layer; and

-   -   S2-5: I/Q domain high-dimensional mapping is performed on the         j^(th) dimension ξ_(j)(t) of the phase domain pre-coded signal         ξ(t) to obtain a j^(th) high-dimensional signal ξ_(j)(t):

${{\xi_{j}(t)} = \begin{bmatrix} {\xi_{j,1}(t)} \\ {\xi_{j,2}(t)} \\  \vdots \\ {\xi_{j,M}(t)} \end{bmatrix}},{{\sum\limits_{k = 1}^{M}{\xi_{j,k}(t)}} = {\xi_{j}(t)}}$

-   -   wherein a number of dimensions of the j^(th) high-dimensional         signal is M, and ξ_(j,k)(t) is the k^(th) dimension of the         j^(th) high-dimensional signal ξ_(j)(t).

In S2-5, the I/Q domain high-dimensional mapping adopts the following methods:

-   -   a first method:

${{\xi_{j,i}(t)} = {\frac{1}{M}{\xi_{j}(t)}}};$

and

-   -   the second method:

${{\xi_{j,i}(t)} = {{\frac{1}{M}{\xi_{j}(t)}} + {n_{i}(t)}}},$

where n_(i)(t) is an i^(th) I/Q domain random offset signal and meets that [n₁(t) n₂(t) . . . n_(M)(t)]^(T) is located in a solution space of an equation

${\sum\limits_{i = 1}^{M}{n_{i}(t)}} = 0.$

-   -   S2-6: the j^(th) high-dimensional signal is processed according         to the I/Q domain high-dimensional precoding signal to obtain a         j^(th) I/Q domain pre-coded signal x_(j)(t):

${x_{j}(t)} = {\begin{bmatrix} {x_{j,1}(t)} \\ {x_{j,2}(t)} \\  \vdots \\ {x_{j,M}(t)} \end{bmatrix} = \begin{bmatrix} {{\xi_{j,1}(t)}{\alpha_{1}\left( {t + {\Delta\tau}} \right)}} \\ {{\xi_{j,2}(t)}{\alpha_{2}\left( {t + {\Delta\tau}} \right)}} \\  \vdots \\ {{\xi_{j,M}(t)}{\alpha_{M}\left( {t + {\Delta\tau}} \right)}} \end{bmatrix}}$

-   -   wherein x_(j,k)(t) represents the k^(th) dimension of the j^(th)         I/Q domain pre-coded signal; and     -   the transmitter combines the j^(th) I/Q domain pre-coded signal         into an I/Q domain pre-coded signal:

${x(t)} = \begin{bmatrix} {x_{1}(t)} \\ {x_{2}(t)} \\  \vdots \\ {x_{N}(t)} \end{bmatrix}$

In S3, a specific process of the I/Q domain matching operation is as follows:

${{\hat{\xi}}_{j}(t)} = \begin{matrix} \left\lbrack {\alpha_{1}^{*}(t)} \right. & {\alpha_{2}^{*}(t)} & \cdots & {{\left. {\alpha_{M}^{*}(t)} \right\rbrack\begin{bmatrix} {{\hat{x}}_{j,1}(t)} \\ {{\hat{x}}_{j,2}(t)} \\  \vdots \\ {{\hat{x}}_{j,M}(t)} \end{bmatrix}} = {\sum\limits_{k = 1}^{M}{{\alpha_{k}^{*}(t)}{{\hat{x}}_{j,k}(t)}}}} \end{matrix}$ ${{\hat{x}(t)} = \begin{bmatrix} {{\hat{x}}_{1}(t)} \\ {{\hat{x}}_{2}(t)} \\  \vdots \\ {{\hat{x}}_{N}(t)} \end{bmatrix}},{{{\hat{x}}_{j}(t)} = \begin{bmatrix} {{\hat{x}}_{j,1}(t)} \\ {{\hat{x}}_{j,2}(t)} \\  \vdots \\ {{\hat{x}}_{j,M}(t)} \end{bmatrix}}$

-   -   wherein {circumflex over (x)}(t) represents an I/Q domain         initial reception signal,

${{\alpha_{k}^{*}(t)} = {\prod\limits_{m = S}^{L}{\exp\left\lbrack {j2{\pi\left( {k_{m} - 1} \right)}\Delta f_{m}t} \right\rbrack}}},$

* represents conjugation, {circumflex over (ξ)}_(i)(t) represents the i^(th) dimension of an I/Q matched signal, and the finally obtained I/Q domain matched signal is as follows:

${\hat{\xi}(t)} = {\begin{bmatrix} {{\hat{\xi}}_{1}(t)} \\ {{\hat{\xi}}_{2}(t)} \\  \vdots \\ {{\hat{\xi}}_{N}(t)} \end{bmatrix}.}$

A specific process of the phase domain matching operation is as follows:

${\text{?}(t)} = {\exp\left\{ {j\left\lbrack {\begin{matrix} {\gamma_{1}(t)} & {\gamma_{2}(t)} & \cdots & {\left. {\left. {\gamma_{N}(t)} \right\rbrack\begin{bmatrix} {\text{?}{{\hat{\xi}}_{1}(t)}} \\ {\text{?}{{\hat{\xi}}_{2}(t)}} \\  \vdots \\ {\text{?}{{\hat{\xi}}_{N}(t)}} \end{bmatrix}} \right\} = {\exp\left\lbrack {j{\sum\limits_{j = 1}^{N}{{\gamma_{j}(t)}\text{?}}}} \right.}} \end{matrix}{{\hat{\xi}}_{j}(t)}} \right\rbrack} \right.}$ ?indicates text missing or illegible when filed

-   -   wherein γ_(j)(t) represents a matched signal corresponding to         β_(j)(t+Δτ) and has a value meeting

γ_(j)(t){δ + ??cos [2π(n_(p) − 1)Δf_(p)t]} = 1mod(2π), ?indicates text missing or illegible when filed

and ŝ′₀(t) represents an estimation of the original signal.

Further, the transmitter adopts a narrow-beam antenna to be pointed to the receiver. 

What is claimed is:
 1. A phase domain modulation method dependent on a spatial position, based on a transmitter, a receiver and a plurality of channel resources, wherein the transmitter is configured to process and transmit an original signal, the receiver is configured to recover the original signal, the channel resources are used by the transmitter and the receiver, the channel resources comprise time-domain, frequency-domain, space-domain and code-domain resources, and the method comprises the following steps: S1: performing a time synchronization by the transmitter and the receiver to obtain a synchronization time; S2: performing by the transmitter, a phase domain precoding operation on the original signal to obtain a phase domain pre-coded signal, and transmitting, by the transmitter, the phase domain pre-coded signal to the receiver using the plurality of channel resources; the phase domain precoding operation comprises the following steps: S2-1: generating, by the transmitter, a high-dimensional precoding signal β(t+Δτ) according to the synchronization time t and a transmission delay Δτ to the receiver: ${\beta\left( {t + {\Delta\tau}} \right)} = \begin{bmatrix} {\beta_{1}\left( {t + {\Delta\tau}} \right)} \\ {\beta_{2}\left( {t + {\Delta\tau}} \right)} \\  \vdots \\ {\beta_{N}\left( {t + {\Delta\tau}} \right)} \end{bmatrix}$ wherein β_(j)(t+Δτ) represents a j^(th) dimension of the high-dimensional precoding signal, j=1, 2, . . . , N, N represents a number of dimensions of the high-dimensional precoding signal, and N does not exceed a number of the channel resources, ${\beta_{j}\left( {t + {\Delta\tau}} \right)} = {\delta + {\prod\limits_{p = 1}^{T}{\text{?}{\cos\left\lbrack {2{\pi\left( {n_{p} - 1} \right)}\Delta{f_{p}\left( {t + {\Delta\tau}} \right)}} \right\rbrack}}}}$ ?indicates text missing or illegible when filed wherein T represents a number of phase domain precoding layers, T≥1, 1≤p≤T, n_(p) represents an index of a p^(th) layer of phase domain precoding branches, 1≤n_(p)≤N_(p), N_(p) represents a number of the p^(th) layer of phase domain precoding branches, N₁×N₂× . . . ×N_(T)=N, ${{n_{T} + {\sum\limits_{p = 1}^{T - 1}\left\lbrack {\left( {n_{p} - 1} \right)\text{?}\text{?}} \right\rbrack}} = j},$ ?indicates text missing or illegible when filed Δf_(p) represents a frequency increment of the p^(th) layer, A_(p,n) _(p) represents an amplitude of a precoding signal on a n_(p) ^(th) branch in the p^(th) layer of phase domain precoding branch, and δ is a normal number agreed by the transmitter and the receiver in advance and has a value meeting ${{\delta + {\prod\limits_{p = 1}^{T}{\text{?}{\cos\left\lbrack {2{\pi\left( {n_{p} - 1} \right)}\Delta{f_{p}\left( {t + {\Delta\tau}} \right)}} \right\rbrack}}}} > 0};$ ?indicates text missing or illegible when filed S2-2: performing phase domain high-dimensional mapping on a phase ∠s₀(t) of the original signal to obtain a high-dimensional original phase signal ∠s(t): ${{\angle{s(t)}} = \begin{bmatrix} {\angle{s_{1}(t)}} \\ \begin{matrix} \begin{matrix} {\angle s_{2}(t)} \\  \vdots  \end{matrix} \\ {\angle s_{N}(t)} \end{matrix} \end{bmatrix}},{{\sum\limits_{j = 1}^{N}{\angle{s_{j}(t)}}} = {\angle{s_{0}(t)}{mod}\left( {2\pi} \right)}}$ wherein a number of dimensions of the high-dimensional original phase signal is N, s_(j)(t) represents a j^(th) dimension of the high-dimensional original signal, and mod is a remainder function; and S2-3: processing the high-dimensional original phase signal according to the high-dimensional precoding signal to obtain a phase domain pre-coded signal ξ(t); ${\zeta\text{?}(t)} = {\begin{bmatrix} \begin{matrix} \begin{matrix} {\zeta_{1}\text{?}(t)} \\ {\zeta_{2}\text{?}(t)} \end{matrix} \\  \vdots  \end{matrix} \\ {\zeta_{N}\text{?}(t)} \end{bmatrix} = \begin{bmatrix} \begin{matrix} \begin{matrix} {\exp\left\lbrack {j^{\prime}{{\angle s}_{1}(t)}{\beta_{1}\left( {t + {\Delta\tau}} \right)}} \right\rbrack} \\ {\exp\left\lbrack {j^{\prime}{\angle s}_{2}(t)\beta_{2}\left( {t + {\Delta\tau}} \right)} \right\rbrack} \end{matrix} \\  \vdots  \end{matrix} \\ {\exp\left\lbrack {j^{\prime}{\angle s}_{N}(t)\beta_{N}\left( {t + {\Delta\tau}} \right)} \right\rbrack} \end{bmatrix}}$ ?indicates text missing or illegible when filed wherein j′=√{square root over (−1)}, and ξ_(j)(t) represents j^(th) dimension of the phase domain pre-coded signal; and S3: receiving, by the receiver, the phase domain pre-coded signal to obtain a phase domain initial reception signal, and performing a phase domain matching operation on the phase domain initial reception signal to obtain an estimation of the original signal; a specific process of the phase domain matching operation is as follows: $\left. {{\text{?}(t)} = {{\exp\begin{bmatrix} \begin{matrix} \begin{matrix} {j^{\prime}\left\lbrack {\gamma_{1}(t)} \right.} & {\gamma_{2}(t)} \end{matrix} & \ldots \end{matrix} & {\gamma_{N}(t)} \end{bmatrix}}\begin{bmatrix} \begin{matrix} \begin{matrix} {{\angle\zeta}_{1}\text{?}(t)} \\ {{\angle\zeta}_{2}\text{?}(t)} \end{matrix} \\  \vdots  \end{matrix} \\ {{\angle\zeta}_{N}\text{?}(t)} \end{bmatrix}}} \right\} = {\exp\left\lbrack {j^{\prime}{\sum\limits_{j = 1}^{N}{{\gamma_{j}(t)}{\angle\zeta}_{j}\text{?}(t)}}} \right\rbrack}$ ?indicates text missing or illegible when filed wherein {circumflex over (ξ)}(t)=[{circumflex over (ξ)}₁(t) {circumflex over (ξ)}₂(t) . . . {circumflex over (ξ)}_(N)(t)]^(T) represents a phase domain initial reception signal, a superscript T represents transposition, [∠{circumflex over (ξ)}₁(t) ∠{circumflex over (ξ)}₂(t) . . . ∠{circumflex over (ξ)}_(N)(t)]^(T) represents a phase of the phase domain initial reception signal, ∠ represents a phase taking operation, γ_(j)(t) represents a matched signal corresponding to β_(j)(t+Δτ) and has a value meeting ${{{\gamma_{1}(t)}\left\{ {\delta + {\prod\limits_{p = 1}^{T}{A_{p,n_{p}}{\cos\left\lbrack {2{\pi\left( {n_{p} - 1} \right)}\Delta f_{p}t} \right\rbrack}}}} \right\}} = {1{mod}\left( {2\pi} \right)}},$ and ŝ′₀(t) represents an estimation of the original signal.
 2. (canceled)
 3. (canceled)
 4. The phase domain modulation method dependent on the spatial position according to claim 1, wherein in S2-2, the phase domain high-dimensional mapping adopts the following methods: a first method: ${{\angle{s_{j}(t)}} = {\frac{1}{N}\angle{s_{0}(t)}}};$ and a second method: ${{\angle{s_{j}(t)}} = {{\frac{1}{N}\angle{s_{0}(t)}} + {\theta_{j}(t)}}},$ wherein θ_(j)(t) is a j^(th) phase domain random offset signal and meets that [θ₁(t) θ₂(t) . . . θ_(N)(t)]^(T) is located in a solution space of an equation ${\sum\limits_{j = i}^{N}{\theta_{j}(t)}} = 0.$
 5. The phase domain modulation method dependent on the spatial position according to claim 1, wherein the transmitter adopts a narrow-beam antenna to be pointed to the receiver.
 6. A spatial position-dependent modulation method, based on a transmitter, a receiver and a plurality of channel resources, wherein the transmitter is configured to process and transmit an original signal, the receiver is configured to recover the original signal, the channel resources are used by the transmitter and the receiver, the channel resources comprise time-domain, frequency-domain, space-domain and code-domain resources, and the method comprises the following steps: S1: performing a time synchronization by the transmitter and the receiver to obtain a synchronization time; S2: performing, by the transmitter, a phase domain precoding operation on the original signal to obtain a phase domain pre-coded signal, performing, by the transmitter, an I/Q domain precoding operation on the phase domain pre-coded signal to obtain an I/Q domain pre-coded signal, and transmitting, by the transmitter, the I/Q domain pre-coded signal to the receiver using the channel resources; the phase domain precoding operation comprises the following steps: S2-1: generating, by the transmitter, a phase domain high-dimensional precoding signal β(t+Δτ) according to the synchronization time t and a transmission delay Δτ to the receiver: ${\beta\left( {t + {\Delta\tau}} \right)} = \begin{bmatrix} {\beta_{1}\left( {t + {\Delta\tau}} \right)} \\ \begin{matrix} \begin{matrix} {\beta_{2}\left( {t + {\Delta\tau}} \right)} \\  \vdots  \end{matrix} \\ {\beta_{N}\left( {t + {\Delta\tau}} \right)} \end{matrix} \end{bmatrix}$ wherein β_(j)(t+Δτ) represents a j^(th) dimension of the phase domain high-dimensional precoding signal, j=1, 2, . . . , N, N represents a number of dimensions of the high-dimensional precoding signal, and N does not exceed a number of the channel resources, ${\beta_{j}\left( {t + {\Delta\tau}} \right)} = {\delta + {\prod\limits_{p = 1}^{T}{A_{p,n_{p}}{\cos\left\lbrack {2{\pi\left( {n_{p} - 1} \right)}\Delta{f_{p}\left( {t + {\Delta\tau}} \right)}} \right\rbrack}}}}$ wherein T represents a number of phase domain precoding layers, T≥1, 1≤p≤T, n_(p) represents an index of a p^(th) layer of phase domain precoding branches, 1≤n_(p)≤N_(p), N_(p) represents a number of the p^(th) layer of phase domain precoding branches, N₁×N₂× . . . ×N_(T)=N, ${{n_{T} + {\sum\limits_{p = 1}^{T - 1}\left\lbrack {\left( {n_{p} - 1} \right)\underset{= {p + 1}}{\overset{T}{\text{?}\prod}}N\text{?}} \right\rbrack}} = j},$ ?indicates text missing or illegible when filed Δf_(p) represents a frequency increment of the p^(th) layer, A_(p,n) _(p) represents an amplitude of a precoding signal on a n_(p) ^(th) branch in the p^(th) layer of phase domain precoding branch, and δ is a normal number agreed by the transmitter and the receiver in advance and has a value meeting ${{\delta + {\prod\limits_{p = 1}^{T}{A_{p,n_{p}}{\cos\left\lbrack {2{\pi\left( {n_{p} - 1} \right)}\Delta{f_{p}\left( {t + {\Delta\tau}} \right)}} \right\rbrack}}}} > 0};$ S2-2: performing phase domain high-dimensional mapping on a phase ∠s₀(t) of the original signal to obtain a high-dimensional original phase signal ∠s(t): ${{\angle{s(t)}} = \begin{bmatrix} {\angle{s_{1}(t)}} \\ \begin{matrix} \begin{matrix} {\angle s_{2}(t)} \\  \vdots  \end{matrix} \\ {\angle s_{N}(t)} \end{matrix} \end{bmatrix}},{{\sum\limits_{j = 1}^{N}{\angle{s_{j}(t)}}} = {\angle{s_{0}(t)}{mod}\left( {2\pi} \right)}}$ wherein a number of dimensions of the high-dimensional original phase signal is N, s_(j)(t) represents a j^(th) dimension of the high-dimensional original signal, and mod is a remainder function; and S2-3: processing the high-dimensional original phase signal according to the high-dimensional precoding signal to obtain a phase domain pre-coded signal ξ(t): ${\zeta\text{?}(t)} = {\begin{bmatrix} \begin{matrix} \begin{matrix} {\zeta_{1}\text{?}(t)} \\ {\zeta_{2}\text{?}(t)} \end{matrix} \\  \vdots  \end{matrix} \\ {\zeta_{N}\text{?}(t)} \end{bmatrix} = \begin{bmatrix} \begin{matrix} \begin{matrix} {\exp\left\lbrack {j^{\prime}{{\angle s}_{1}(t)}{\beta_{1}\left( {t + {\Delta\tau}} \right)}} \right\rbrack} \\ {\exp\left\lbrack {j^{\prime}{\angle s}_{2}(t)\beta_{2}\left( {t + {\Delta\tau}} \right)} \right\rbrack} \end{matrix} \\  \vdots  \end{matrix} \\ {\exp\left\lbrack {j^{\prime}{\angle s}_{N}(t)\beta_{N}\left( {t + {\Delta\tau}} \right)} \right\rbrack} \end{bmatrix}}$ ?indicates text missing or illegible when filed wherein j′=√{square root over (−1)}, represents a j^(th) dimension of the phase domain pre-coded signal; and the I/Q domain precoding operation comprises the following steps: S2-4: generating, by the transmitter, an I/Q domain high-dimensional precoding signal α(t+Δτ) according to the synchronization time t and a transmission delay Δτ to the receiver: ${\alpha\left( {t + {\Delta\tau}} \right)} = \begin{bmatrix} \begin{matrix} \begin{matrix} {\alpha_{1}\left( {t + {\Delta\tau}} \right)} \\ {\alpha_{2}\left( {t + {\Delta\tau}} \right)} \end{matrix} \\  \vdots  \end{matrix} \\ {\alpha_{M}\left( {t + {\Delta\tau}} \right)} \end{bmatrix}$ wherein α_(i)(t+Δτ) represents an i^(th) dimension of the I/Q domain high-dimensional precoding signal, i=1, 2, . . . , M, M represents the number of dimensions of the high-dimensional precoding signal, and M×N does not exceed the number of the channel resources, ${\alpha_{1}\left( {t + {\Delta\tau}} \right)} = {\prod\limits_{m = 1}^{L}{\exp\left\lbrack {{- j^{\prime}}2{\pi\left( {k_{m} - 1} \right)}\Delta{f_{m}\left( {t + {\Delta\tau}} \right)}} \right\rbrack}}$ wherein m=1, 2, . . . , L, L represents a number of I/Q domain precoding layers, L≥1, k_(m) represents an index of an m^(th) layer of I/Q domain precoding branches, 1≤k_(m)≤M_(m), M_(m) represents a number of the m^(th) layer of I/Q domain precoding branches, M₁×M₂× . . . ×M_(L)=M, ${{k_{L} + {\sum\limits_{m = 1}^{L - 1}\left\lbrack {\left( {k_{m} - 1} \right){\prod\limits_{l = {m + 1}}^{L}M_{l}}} \right\rbrack}} = i},$ and Δf_(m) represents a frequency increment of the m^(th) layer; and S2-5: performing I/Q domain high-dimensional mapping on the j^(th) dimension ξ_(j)(t) of the phase domain pre-coded signal ξ(t) to obtain a j^(th) high-dimensional signal ξ_(j)(t); ${{\xi_{j}(t)} = \begin{bmatrix} {\xi_{j,1}(t)} \\ {\xi_{j,2}(t)} \\  \vdots \\ {\xi_{j,M}(t)} \end{bmatrix}},$ ${\sum\limits_{k = 1}^{M}{\xi_{j,k}(t)}} = {\xi_{j}(t)}$ wherein a number of dimensions of the j^(th) high-dimensional signal is M, and ξ_(j,k)(t) is a k^(th) dimension of the j^(th) high-dimensional signal ξ_(j)(t); and S2-6: processing the j^(th) high-dimensional signal according to the I/Q domain high-dimensional precoding signal to obtain a j^(th) I/Q domain pre-coded signal x_(j)(t); ${x_{j}(t)} = {\begin{bmatrix} {x_{j,1}(t)} \\ {x_{j,2}(t)} \\  \vdots \\ {x_{j,M}(t)} \end{bmatrix} = \begin{bmatrix} {{\xi_{j,1}(t)}{\alpha_{1}\left( {t + {\Delta\tau}} \right)}} \\ {{\xi_{j,2}(t)}{\alpha_{2}\left( {t + {\Delta\tau}} \right)}} \\  \vdots \\ {{\xi_{j,M}(t)}{\alpha_{M}\left( {t + {\Delta\tau}} \right)}} \end{bmatrix}}$ wherein x_(j,k)(t) represents a k^(th) dimension of the j^(th) I/Q domain pre-coded signal, and combining, by the transmitter, the j^(th) I/Q domain pre-coded signal into an I/Q domain pre-coded signal: ${{x(t)} = \begin{bmatrix} {x_{1}(t)} \\ {x_{2}(t)} \\  \vdots \\ {x_{N}(t)} \end{bmatrix}};$ and S3: receiving, by the receiver, the I/Q domain pre-coded signal to obtain an I/Q domain initial reception signal, performing an I/Q domain matching operation on the I/Q domain initial reception signal to obtain an I/Q domain matched signal, and performing, by the receiver, a phase domain matching operation on the I/Q domain matched signal to obtain an estimation of the original signal; a specific process of the I/Q domain matching operation is as follows: ${{\hat{\xi}}_{j}(t)} = \left\lbrack \begin{matrix} {\alpha_{1}^{*}(t)} & {\alpha_{2}^{*}(t)} & \cdots & {{\left. {\alpha_{M}^{*}(t)} \right\rbrack\begin{bmatrix} {{\hat{x}}_{j,1}(t)} \\ {{\hat{x}}_{j,2}(t)} \\  \vdots \\ {{\hat{x}}_{j,M}(t)} \end{bmatrix}} = {\sum\limits_{k = 1}^{M}{{\alpha_{k}^{*}(t)}{{\hat{x}}_{j,k}(t)}}}} \end{matrix} \right.$ ${{\hat{x}(t)} = \begin{bmatrix} {{\hat{x}}_{1}(t)} \\ {{\hat{x}}_{2}(t)} \\  \vdots \\ {{\hat{x}}_{N}(t)} \end{bmatrix}},$ ${{\hat{x}}_{j}(t)} = \begin{bmatrix} {{\hat{x}}_{j,1}(t)} \\ {{\hat{x}}_{j,2}(t)} \\  \vdots \\ {{\hat{x}}_{j,M}(t)} \end{bmatrix}$ wherein {circumflex over (x)}(t) represents an I/Q domain initial reception signal, ${{\alpha_{k}^{*}(t)} = {\prod\limits_{m = 1}^{L}{\exp\left\lbrack {{j'}2{\pi\left( {k_{m} - 1} \right)}\Delta f_{m}t} \right\rbrack}}},$ * represents conjugation, {circumflex over (ξ)}_(i)(t) represents an i^(th) dimension of an I/Q matched signal, and the finally obtained I/Q domain matched signal is as follows: ${\hat{\xi}(t)} = \begin{bmatrix} {{\hat{\xi}}_{1}(t)} \\ {{\hat{\xi}}_{2}(t)} \\  \vdots \\ {{\hat{\xi}}_{N}(t)} \end{bmatrix}$ a specific process of the phase domain matching operation is as follows: ${{\hat{s}}_{0}^{\prime}(t)} = {{\exp\left\{ {{j^{\prime}\begin{bmatrix} {\gamma_{1}(t)} & {\gamma_{2}(t)} & \cdots & {\gamma_{N}(t)} \end{bmatrix}}\begin{bmatrix} {\angle{{\hat{\xi}}_{1}(t)}} \\ {\angle{\hat{\xi}}_{2}(t)} \\  \vdots \\ {\angle{\hat{\xi}}_{N}(t)} \end{bmatrix}} \right\}} = {\exp\left\lbrack {j^{\prime}{\sum\limits_{j = 1}^{N}{{\gamma_{j}(t)}\angle{{\hat{\xi}}_{j}(t)}}}} \right\rbrack}}$ wherein γ_(j)(t) represents a matched signal corresponding to β_(j)(t+Δτ) and has a value meeting ${{{\gamma_{j}(t)}\left\{ {\delta + {\prod\limits_{p = 1}^{T}{A_{p,n_{p}}{\cos\left\lbrack {2{\pi\left( {n_{p} - 1} \right)}\Delta f_{p}t} \right\rbrack}}}} \right\}} = {1{{mod}\left( {2\pi} \right)}}},$ and ŝ′₀(t) represents an estimation of the original signal.
 7. (canceled)
 8. (canceled)
 9. The spatial position-dependent modulation method according to claim 6, wherein in S2-2, the phase domain high-dimensional mapping adopts the following methods: a first method: ${{\angle{s_{j}(t)}} = {\frac{1}{N}\angle{s_{0}(t)}}};$ and a second method: ${{\angle{s_{j}(t)}} = {{\frac{1}{N}\angle{s_{0}(t)}} + {\theta_{j}(t)}}},$ wherein θ_(j)(t) is a j^(th) phase domain random offset signal and meets that [θ₁(t) θ₂(t) . . . θ_(N)(t)]^(T) is located in a solution space of an equation ${\sum\limits_{j = 1}^{N}{\theta_{j}(t)}} = 0.$
 10. The spatial position-dependent modulation method according to claim 6, wherein in S2-5, the I/Q domain high-dimensional mapping adopts the following methods: a first method: ${{\xi_{j,1}(t)} = {\frac{1}{M}{\xi_{j}(t)}}};$ and a second method: ${{\xi_{j,1}(t)} = {{\frac{1}{M}{\xi_{j}(t)}} + {n_{i}(t)}}},$ wherein n^(i)(t) is an i^(th) I/Q domain random offset signal and meets that [n₁(t) n₂(t) . . . n_(M)(t)]^(T) is located in a solution space of an equation ${\sum\limits_{i = 1}^{M}{n_{i}(t)}} = 0.$ 